On Finding the Maximum Number of DisjointCuts in
نویسنده
چکیده
In the CUT PACKING problem, given an undirected connected graph G, it is required to nd the maximum number of pairwise edge disjoint cuts in G. It is an open question if CUT PACKING is NP-hard on general graphs. In this paper we prove that the problem is polynomially solvable on Seymour graphs which include both all bipar-tite and all series-parallel graphs. We also consider the weighted version of the problem in which each edge of the graph G has a nonnegative weight and the weight of a cut D is equal to the maximum weight of edges in D. We show that the weighted version is NP-hard even on cubic planar graphs.
منابع مشابه
Maximum Allowable Load On Wheeled Mobile Manipulators (RESEARCH NOTE)
This paper develops a computational technique for finding the maximum allowable load of mobile manipulators for a given trajectory. The maximum allowable loads which can be achieved by a mobile manipulator during a given trajectory are limited by the number of factors; probably the dynamic properties of mobile base and mounted manipulator, their actuator limitations and additional constraints a...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملContent and Structural Analysis of Articles Published in Knowledge Management Indexed in I.S.C. Database
Aim: The aim of this study is content and structural analysis of published articles in knowledge Management. Methodology: The research method is analytical. The population encompassed all articles in the field of knowledge management indexed in the citation database of the Islamic world. Measurement tool is a checklist constructed based on research objectives. Finding: Finding indicate that th...
متن کاملEffect of Blade Design Parameters on Air Flow through an Axial Fan
The objective of this paper is the numerical study of the flow through an axial fan and examining the effects of blade design parameters on the performance of the fan. The axial fan is extensively used for cooling of the electronic devices and servers. Simulation of the three-dimensional incompressible turbulent flow was conducted by numerical solution of the (RANS) equations for a model. The S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999